0.00/0.06	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.07	% Command    : run_vampire %s %d
0.06/0.25	% Computer   : n010.cluster.edu
0.06/0.25	% Model      : x86_64 x86_64
0.06/0.25	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.06/0.25	% Memory     : 8042.1875MB
0.06/0.25	% OS         : Linux 3.10.0-693.el7.x86_64
0.06/0.25	% CPULimit   : 960
0.06/0.25	% WCLimit    : 120
0.06/0.25	% DateTime   : Thu Jul  2 07:27:57 EDT 2020
0.06/0.25	% CPUTime    : 
0.10/0.30	% (10330)lrs+1011_8_add=large:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:afp=100000:afq=1.1:er=filter:gsp=input_only:gs=on:gsem=on:lma=on:nm=6:nwc=1:stl=30:sd=2:ss=axioms:st=1.5:sos=on_3 on theBenchmark
0.10/0.30	% (10328)ott+1002_2_av=off:bd=preordered:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:irw=on:lma=on:nm=64:nwc=10:sp=reverse_arity:updr=off_2 on theBenchmark
0.10/0.30	% (10350)dis+10_4_av=off:bsr=on:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:cond=fast:er=filter:fde=none:gsp=input_only:lcm=reverse:lma=on:nwc=4:sp=occurrence:urr=on_8 on theBenchmark
0.10/0.30	% (10329)lrs-11_4:1_afp=4000:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:afq=2.0:anc=none:br=off:gs=on:lwlo=on:nm=64:nwc=3:stl=30:urr=on_2 on theBenchmark
0.10/0.30	% (10331)dis+10_128_acc=on:add=off:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:afp=4000:afq=1.4:amm=off:bd=preordered:cond=on:fsr=off:fde=unused:gs=on:gsem=on:irw=on:lma=on:nm=64:nwc=1.2:nicw=on:sos=on:sp=occurrence:updr=off:uhcvi=on_2 on theBenchmark
0.10/0.30	% (10341)lrs+1010_3_av=off:fsr=off:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:gs=on:gsem=off:nm=2:newcnf=on:nwc=2:stl=30:sp=reverse_arity:urr=on:updr=off_9 on theBenchmark
0.10/0.31	% (10342)lrs+1002_1_av=off:er=filter:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:fsr=off:gs=on:gsem=off:irw=on:lma=on:nm=4:nwc=1:stl=30:sd=3:ss=axioms:st=1.5:sos=on_1 on theBenchmark
0.10/0.31	% (10330)Refutation found. Thanks to Tanya!
0.10/0.31	% SZS status Theorem for theBenchmark
0.10/0.31	% SZS output start Proof for theBenchmark
0.10/0.31	tff(func_def_3, type, ->: ('$tType' * '$tType') > '$tType').
0.10/0.31	tff(func_def_4, type, vAPP: !>[X0: $ttype, X1: $ttype]:(X0 -> X1 * X0) > X1).
0.10/0.31	tff(func_def_5, type, vEPSILON: !>[X0: $ttype]:(X0 -> '$o') -> X0).
0.10/0.31	tff(func_def_6, type, vEQ: !>[X0: $ttype]:X0 -> X0 -> '$o').
0.10/0.31	tff(func_def_7, type, vIMP: '$o' -> '$o' -> '$o').
0.10/0.31	tff(func_def_8, type, vPI: !>[X0: $ttype]:(X0 -> '$o') -> '$o').
0.10/0.31	tff(func_def_9, type, iCOMB: !>[X2: $ttype]:X2 -> X2).
0.10/0.31	tff(func_def_10, type, sCOMB: !>[X0: $ttype, X1: $ttype, X2: $ttype]:(X0 -> X1 -> X2) -> (X0 -> X1) -> X0 -> X2).
0.10/0.31	tff(func_def_11, type, cCOMB: !>[X0: $ttype, X1: $ttype, X2: $ttype]:(X0 -> X1 -> X2) -> X1 -> X0 -> X2).
0.10/0.31	tff(func_def_12, type, bCOMB: !>[X0: $ttype, X1: $ttype, X2: $ttype]:(X1 -> X2) -> (X0 -> X1) -> X0 -> X2).
0.10/0.31	tff(func_def_14, type, kCOMB: !>[X1: $ttype, X2: $ttype]:X1 -> X2 -> X1).
0.10/0.31	tff(func_def_15, type, vAND: '$o' -> '$o' -> '$o').
0.10/0.31	tff(func_def_16, type, vOR: '$o' -> '$o' -> '$o').
0.10/0.31	tff(func_def_17, type, vNOT: '$o' -> '$o').
0.10/0.31	tff(func_def_22, type, sK3: '$i' -> '$i' -> '$o').
0.10/0.31	tff(func_def_23, type, sK4: ('$i' -> '$i' -> '$o') -> '$i').
0.10/0.31	tff(f1,conjecture,(
0.10/0.31	  (^[X0 : '$i', X1 : '$i'] : X0 = X1) = (^[X2 : '$i', X3 : '$i'] : ! [X4 : '$i' -> '$i' -> '$o'] : (! [X5] : X4 @ X5 @ X5 => X4 @ X2 @ X3))),
0.10/0.31	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM47C_pme)).
0.10/0.31	tff(f2,negated_conjecture,(
0.10/0.31	  ~(^[X0 : '$i', X1 : '$i'] : X0 = X1) = (^[X2 : '$i', X3 : '$i'] : ! [X4 : '$i' -> '$i' -> '$o'] : (! [X5] : X4 @ X5 @ X5 => X4 @ X2 @ X3))),
0.10/0.31	  inference(negated_conjecture,[],[f1])).
0.10/0.31	tff(f3,plain,(
0.10/0.31	  ~(^[X0 : '$i', X1 : '$i'] : X0 = X1) = (^[X2 : '$i', X3 : '$i'] : ! [X4 : '$i' -> '$i' -> '$o'] : (! [X5] : X4 @ X5 @ X5 => X4 @ X2 @ X3))),
0.10/0.31	  inference(rectify,[],[f2])).
0.10/0.31	tff(f4,plain,(
0.10/0.31	  ~bCOMB @ (bCOMB @ vPI('$i' -> '$i' -> '$o')) @ (bCOMB @ (bCOMB @ (sCOMB @ (bCOMB @ vIMP @ (bCOMB @ vPI('$i') @ (cCOMB @ sCOMB @ iCOMB))))) @ (bCOMB @ cCOMB @ (cCOMB @ iCOMB))) = vEQ('$i')),
0.10/0.31	  inference(fool_elimination,[],[f3])).
0.10/0.31	tff(f5,plain,(
0.10/0.31	  bCOMB @ (bCOMB @ vPI('$i' -> '$i' -> '$o')) @ (bCOMB @ (bCOMB @ (sCOMB @ (bCOMB @ vIMP @ (bCOMB @ vPI('$i') @ (cCOMB @ sCOMB @ iCOMB))))) @ (bCOMB @ cCOMB @ (cCOMB @ iCOMB))) != vEQ('$i')),
0.10/0.31	  inference(flattening,[],[f4])).
0.10/0.31	tff(f6,plain,(
0.10/0.31	  bCOMB @ (bCOMB @ vPI('$i' -> '$i' -> '$o')) @ (bCOMB @ (bCOMB @ (sCOMB @ (bCOMB @ vIMP @ (bCOMB @ vPI('$i') @ (cCOMB @ sCOMB @ iCOMB))))) @ (bCOMB @ cCOMB @ (cCOMB @ iCOMB))) != vEQ('$i')),
0.10/0.31	  inference(cnf_transformation,[],[f5])).
0.10/0.31	tff(f7,plain,(
0.10/0.31	  vEQ('$i') @ sK1 != bCOMB @ (bCOMB @ vPI('$i' -> '$i' -> '$o')) @ (bCOMB @ (bCOMB @ (sCOMB @ (bCOMB @ vIMP @ (bCOMB @ vPI('$i') @ (cCOMB @ sCOMB @ iCOMB))))) @ (bCOMB @ cCOMB @ (cCOMB @ iCOMB))) @ sK1),
0.10/0.31	  inference(negative_extensionality,[],[f6])).
0.10/0.31	tff(f8,plain,(
0.10/0.31	  vEQ('$i') @ sK1 != bCOMB @ vPI('$i' -> '$i' -> '$o') @ (bCOMB @ (sCOMB @ (bCOMB @ vIMP @ (bCOMB @ vPI('$i') @ (cCOMB @ sCOMB @ iCOMB)))) @ (cCOMB @ (cCOMB @ iCOMB @ sK1)))),
0.10/0.31	  inference(combinator_demodulation,[],[f7])).
0.10/0.31	tff(f9,plain,(
0.10/0.31	  (vEQ('$i') @ sK1 @ sK2 != bCOMB @ vPI('$i' -> '$i' -> '$o') @ (bCOMB @ (sCOMB @ (bCOMB @ vIMP @ (bCOMB @ vPI('$i') @ (cCOMB @ sCOMB @ iCOMB)))) @ (cCOMB @ (cCOMB @ iCOMB @ sK1))) @ sK2)),
0.10/0.31	  inference(negative_extensionality,[],[f8])).
0.10/0.31	tff(f10,plain,(
0.10/0.31	  (vEQ('$i') @ sK1 @ sK2 != vPI('$i' -> '$i' -> '$o') @ (sCOMB @ (bCOMB @ vIMP @ (bCOMB @ vPI('$i') @ (cCOMB @ sCOMB @ iCOMB))) @ (cCOMB @ (cCOMB @ iCOMB @ sK1) @ sK2)))),
0.10/0.31	  inference(combinator_demodulation,[],[f9])).
0.10/0.31	tff(f11,plain,(
0.10/0.31	  (vEQ('$i') @ sK1 @ sK2 = $true) | (vPI('$i' -> '$i' -> '$o') @ (sCOMB @ (bCOMB @ vIMP @ (bCOMB @ vPI('$i') @ (cCOMB @ sCOMB @ iCOMB))) @ (cCOMB @ (cCOMB @ iCOMB @ sK1) @ sK2)) = $true)),
0.10/0.31	  inference(binary_proxy_clausification,[],[f10])).
0.10/0.31	tff(f12,plain,(
0.10/0.31	  (vEQ('$i') @ sK1 @ sK2 = $false) | (vPI('$i' -> '$i' -> '$o') @ (sCOMB @ (bCOMB @ vIMP @ (bCOMB @ vPI('$i') @ (cCOMB @ sCOMB @ iCOMB))) @ (cCOMB @ (cCOMB @ iCOMB @ sK1) @ sK2)) = $false)),
0.10/0.31	  inference(binary_proxy_clausification,[],[f10])).
0.10/0.31	tff(f13,plain,(
0.10/0.31	  (vEQ('$i') @ sK1 @ sK2 = $false) | (sCOMB @ (bCOMB @ vIMP @ (bCOMB @ vPI('$i') @ (cCOMB @ sCOMB @ iCOMB))) @ (cCOMB @ (cCOMB @ iCOMB @ sK1) @ sK2) @ sK3 = $false)),
0.10/0.31	  inference(sigma_clausification,[],[f12])).
0.10/0.31	tff(f14,plain,(
0.10/0.31	  sK1 != sK2 | (sCOMB @ (bCOMB @ vIMP @ (bCOMB @ vPI('$i') @ (cCOMB @ sCOMB @ iCOMB))) @ (cCOMB @ (cCOMB @ iCOMB @ sK1) @ sK2) @ sK3 = $false)),
0.10/0.31	  inference(equality_proxy_clausification,[],[f13])).
0.10/0.31	tff(f15,plain,(
0.10/0.31	  sK1 != sK2 | (vIMP @ (vPI('$i') @ (sCOMB @ sK3 @ iCOMB)) @ (sK3 @ sK1 @ sK2) = $false)),
0.10/0.31	  inference(combinator_demodulation,[],[f14])).
0.10/0.31	tff(f16,plain,(
0.10/0.31	  sK1 != sK2 | (vPI('$i') @ (sCOMB @ sK3 @ iCOMB) = $true)),
0.10/0.31	  inference(binary_proxy_clausification,[],[f15])).
0.10/0.31	tff(f17,plain,(
0.10/0.31	  sK1 != sK2 | (sK3 @ sK1 @ sK2 = $false)),
0.10/0.31	  inference(binary_proxy_clausification,[],[f15])).
0.10/0.31	tff(f18,plain,(
0.10/0.31	  ( ! [X1] : (sK1 != sK2 | (sCOMB @ sK3 @ iCOMB @ X1 = $true)) )),
0.10/0.31	  inference(pi_clausification,[],[f16])).
0.10/0.31	tff(f19,plain,(
0.10/0.31	  ( ! [X1] : (sK1 != sK2 | (sK3 @ X1 @ X1 = $true)) )),
0.10/0.31	  inference(combinator_demodulation,[],[f18])).
0.10/0.31	tff(f20,plain,(
0.10/0.31	  ( ! [X1:'$i' -> '$i' -> '$o'] : ((vEQ('$i') @ sK1 @ sK2 = $true) | (sCOMB @ (bCOMB @ vIMP @ (bCOMB @ vPI('$i') @ (cCOMB @ sCOMB @ iCOMB))) @ (cCOMB @ (cCOMB @ iCOMB @ sK1) @ sK2) @ X1 = $true)) )),
0.10/0.31	  inference(pi_clausification,[],[f11])).
0.10/0.31	tff(f21,plain,(
0.10/0.31	  ( ! [X1:'$i' -> '$i' -> '$o'] : (sK1 = sK2 | (sCOMB @ (bCOMB @ vIMP @ (bCOMB @ vPI('$i') @ (cCOMB @ sCOMB @ iCOMB))) @ (cCOMB @ (cCOMB @ iCOMB @ sK1) @ sK2) @ X1 = $true)) )),
0.10/0.31	  inference(equality_proxy_clausification,[],[f20])).
0.10/0.31	tff(f22,plain,(
0.10/0.31	  ( ! [X1:'$i' -> '$i' -> '$o'] : (sK1 = sK2 | (vIMP @ (vPI('$i') @ (sCOMB @ X1 @ iCOMB)) @ (X1 @ sK1 @ sK2) = $true)) )),
0.10/0.31	  inference(combinator_demodulation,[],[f21])).
0.10/0.31	tff(f23,plain,(
0.10/0.31	  ( ! [X1:'$i' -> '$i' -> '$o'] : (sK1 = sK2 | (vPI('$i') @ (sCOMB @ X1 @ iCOMB) = $false) | (X1 @ sK1 @ sK2 = $true)) )),
0.10/0.31	  inference(binary_proxy_clausification,[],[f22])).
0.10/0.31	tff(f24,plain,(
0.10/0.31	  ( ! [X1:'$i' -> '$i' -> '$o'] : (sK1 = sK2 | (sCOMB @ X1 @ iCOMB @ (sK4 @ X1) = $false) | (X1 @ sK1 @ sK2 = $true)) )),
0.10/0.31	  inference(sigma_clausification,[],[f23])).
0.10/0.31	tff(f25,plain,(
0.10/0.31	  ( ! [X1:'$i' -> '$i' -> '$o'] : (sK1 = sK2 | (X1 @ (sK4 @ X1) @ (sK4 @ X1) = $false) | (X1 @ sK1 @ sK2 = $true)) )),
0.10/0.31	  inference(combinator_demodulation,[],[f24])).
0.10/0.31	tff(f27,plain,(
0.10/0.31	  spl0_0 <=> ! [X1 : '$i' -> '$i' -> '$o'] : ((X1 @ (sK4 @ X1) @ (sK4 @ X1) = $false) | (X1 @ sK1 @ sK2 = $true))),
0.10/0.31	  introduced(avatar_definition,[new_symbols(naming,[spl0_0])])).
0.10/0.31	tff(f28,plain,(
0.10/0.31	  ( ! [X1:'$i' -> '$i' -> '$o'] : ((X1 @ sK1 @ sK2 = $true) | (X1 @ (sK4 @ X1) @ (sK4 @ X1) = $false)) ) | ~spl0_0),
0.10/0.31	  inference(avatar_component_clause,[],[f27])).
0.10/0.31	tff(f30,plain,(
0.10/0.31	  spl0_3 <=> sK1 != sK2),
0.10/0.31	  introduced(avatar_definition,[new_symbols(naming,[spl0_3])])).
0.10/0.31	tff(f31,plain,(
0.10/0.31	  sK1 != sK2 | ~spl0_3),
0.10/0.31	  inference(avatar_component_clause,[],[f30])).
0.10/0.31	tff(f33,plain,(
0.10/0.31	  spl0_2 <=> sK1 = sK2),
0.10/0.31	  introduced(avatar_definition,[new_symbols(naming,[spl0_2])])).
0.10/0.31	tff(f34,plain,(
0.10/0.31	  sK1 = sK2 | ~spl0_2),
0.10/0.31	  inference(avatar_component_clause,[],[f33])).
0.10/0.31	tff(f35,plain,(
0.10/0.31	  spl0_0 | spl0_2),
0.10/0.31	  inference(avatar_split_clause,[],[f25,f33,f27])).
0.10/0.31	tff(f37,plain,(
0.10/0.31	  spl0_4 <=> ! [X1] : (sK3 @ X1 @ X1 = $true)),
0.10/0.31	  introduced(avatar_definition,[new_symbols(naming,[spl0_4])])).
0.10/0.31	tff(f38,plain,(
0.10/0.31	  ( ! [X1] : ((sK3 @ X1 @ X1 = $true)) ) | ~spl0_4),
0.10/0.31	  inference(avatar_component_clause,[],[f37])).
0.10/0.31	tff(f39,plain,(
0.10/0.31	  spl0_4 | ~spl0_3),
0.10/0.31	  inference(avatar_split_clause,[],[f19,f30,f37])).
0.10/0.31	tff(f44,plain,(
0.10/0.31	  spl0_6 <=> (sK3 @ sK1 @ sK2 = $false)),
0.10/0.31	  introduced(avatar_definition,[new_symbols(naming,[spl0_6])])).
0.10/0.31	tff(f45,plain,(
0.10/0.31	  (sK3 @ sK1 @ sK2 = $false) | ~spl0_6),
0.10/0.31	  inference(avatar_component_clause,[],[f44])).
0.10/0.31	tff(f46,plain,(
0.10/0.31	  spl0_6 | ~spl0_3),
0.10/0.31	  inference(avatar_split_clause,[],[f17,f30,f44])).
0.10/0.31	tff(f47,plain,(
0.10/0.31	  (sK3 @ sK1 @ sK1 = $false) | (~spl0_2 | ~spl0_6)),
0.10/0.31	  inference(backward_demodulation,[],[f34,f45])).
0.10/0.31	tff(f49,plain,(
0.10/0.31	  ($false = $true) | (~spl0_2 | ~spl0_4 | ~spl0_6)),
0.10/0.31	  inference(superposition,[],[f47,f38])).
0.10/0.31	tff(f53,plain,(
0.10/0.31	  $false | (~spl0_2 | ~spl0_4 | ~spl0_6)),
0.10/0.31	  inference(trivial_inequality_removal,[],[f49])).
0.10/0.31	tff(f54,plain,(
0.10/0.31	  ~spl0_2 | ~spl0_4 | ~spl0_6),
0.10/0.31	  inference(avatar_contradiction_clause,[],[f53])).
0.10/0.31	tff(f56,plain,(
0.10/0.31	  (vEQ('$i') @ sK1 @ sK2 = $true) | (vEQ('$i') @ (sK4 @ vEQ('$i')) @ (sK4 @ vEQ('$i')) = $false) | ~spl0_0),
0.10/0.31	  inference(primitive_instantiation,[],[f28])).
0.10/0.31	tff(f71,plain,(
0.10/0.31	  (vEQ('$i') @ sK1 @ sK2 = $true) | ($false = $true) | ~spl0_0),
0.10/0.31	  inference(boolean_simplification,[],[f56])).
0.10/0.31	tff(f72,plain,(
0.10/0.31	  (vEQ('$i') @ sK1 @ sK2 = $true) | ~spl0_0),
0.10/0.31	  inference(trivial_inequality_removal,[],[f71])).
0.10/0.31	tff(f73,plain,(
0.10/0.31	  sK1 = sK2 | ~spl0_0),
0.10/0.31	  inference(equality_proxy_clausification,[],[f72])).
0.10/0.31	tff(f74,plain,(
0.10/0.31	  $false | (~spl0_0 | ~spl0_3)),
0.10/0.31	  inference(subsumption_resolution,[],[f73,f31])).
0.10/0.31	tff(f75,plain,(
0.10/0.31	  ~spl0_0 | spl0_3),
0.10/0.31	  inference(avatar_contradiction_clause,[],[f74])).
0.10/0.31	tff(f76,plain,(
0.10/0.31	  $false),
0.10/0.31	  inference(avatar_sat_refutation,[],[f35,f39,f46,f54,f75])).
0.10/0.31	% SZS output end Proof for theBenchmark
0.10/0.31	% (10330)------------------------------
0.10/0.31	% (10330)Version: Vampire 4.5.0 (commit 7ae30c7f on 2020-06-30 15:57:20 +0100)
0.10/0.31	% (10330)Termination reason: Refutation
0.10/0.31	
0.10/0.31	% (10330)Memory used [KB]: 9850
0.10/0.31	% (10330)Time elapsed: 0.032 s
0.10/0.31	% (10330)------------------------------
0.10/0.31	% (10330)------------------------------
0.10/0.31	% (10347)dis+1002_3:1_acc=model:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:afr=on:afp=40000:afq=1.1:anc=none:ccuc=first:fsr=off:gsp=input_only:irw=on:nm=16:nwc=1:sos=all_8 on theBenchmark
0.10/0.31	% (10327)Success in time 0.047 s
0.10/0.31	EOF